Перевод: с английского на все языки

со всех языков на английский

admissible topology

См. также в других словарях:

  • Admissible representation — In mathematics, admissible representations are a well behaved class of representations used in the representation theory of reductive Lie groups over real or p adic fields. They were introduced by Harish Chandra.Real reductive groupsFor real… …   Wikipedia

  • Rigid analytic space — In mathematics, a rigid analytic space is an analogue of a complex analytic space over a nonarchimedean field. They were introduced by John Tate in 1962, as an outgrowth of his work on uniformizing p adic elliptic curves with bad reduction using… …   Wikipedia

  • Subshift of finite type — In mathematics, subshifts of finite type are used to model dynamical systems, and in particular are the objects of study in symbolic dynamics and ergodic theory. They also describe the set of all possible sequences executed by a finite state… …   Wikipedia

  • Ultralimit — For the direct limit of a sequence of ultrapowers, see Ultraproduct. In mathematics, an ultralimit is a geometric construction that assigns to a sequence of metric spaces Xn a limiting metric space. The notion of an ultralimit captures the… …   Wikipedia

  • Algebraic K-theory — In mathematics, algebraic K theory is an important part of homological algebra concerned with defining and applying a sequence Kn(R) of functors from rings to abelian groups, for all integers n. For historical reasons, the lower K groups K0 and… …   Wikipedia

  • Coherent states in mathematical physics — Coherent states have been introduced in a physical context, first as quasi classical states in quantum mechanics, then as the backbone of quantum optics and they are described in that spirit in the article Coherent states (see also [1]). However …   Wikipedia

  • List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

  • A* search algorithm — In computer science, A* (pronounced A star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). It uses a distance plus cost heuristic function… …   Wikipedia

  • Lemme De Zorn — En mathématiques, Le lemme de Zorn (ou théorème de Zorn, ou parfois lemme de Kuratowski Zorn), est un théorème de la théorie des ensembles qui affirme qu un ensemble ordonné tel que toute chaîne (sous ensemble totalement ordonné) possède un… …   Wikipédia en Français

  • Lemme de Zorn — En mathématiques, le lemme de Zorn (ou théorème de Zorn, ou parfois lemme de Kuratowski Zorn), est un théorème de la théorie des ensembles qui affirme que si un ensemble ordonné est tel que toute chaîne (sous ensemble totalement ordonné) possède… …   Wikipédia en Français

  • Lemme de zorn — En mathématiques, Le lemme de Zorn (ou théorème de Zorn, ou parfois lemme de Kuratowski Zorn), est un théorème de la théorie des ensembles qui affirme qu un ensemble ordonné tel que toute chaîne (sous ensemble totalement ordonné) possède un… …   Wikipédia en Français

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»